The Polynomial Method in Circuit Complexity

نویسنده

  • Richard Beigel
چکیده

The representation of functions as low-degree polyno-mials over various rings has provided many insights in the theory of small-depth circuits. We survey some of the closure properties, upper bounds, and lower bounds obtained via this approach.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Polynomial Method in Circuit Complexity Applied to Algorithm Design∗

In circuit complexity, the polynomial method is a general approach to proving circuit lower bounds in restricted settings. One shows that functions computed by sufficiently restricted circuits are “correlated” in some way with a low-complexity polynomial, where complexity may be measured by the degree of the polynomial or the number of monomials. Then, results limiting the capabilities of low-c...

متن کامل

Efficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields

This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...

متن کامل

Constructing elusive functions with help of evaluation mappings

We introduce a general concept of complexity and a polynomial type algebraic complexity of a polynomial mapping. The notion of polynomial type algebraic complexity encompasses the determinantal complexity. We analyze the relation between polynomial type algebraic complexities and elusive functions. We study geometric-algebraic properties of polynomial type computational complexities. We present...

متن کامل

Optimal Resilience for Short-Circuit Noise in Formulas

We show an efficient method for converting a logic circuit of gates with fan-out 1 into an equivalent circuit that works even if some fraction of its gates are short-circuited, i.e., their output is shortcircuited to one of their inputs. Our conversion can be applied to any circuit with fan-in k>= 2, yielding a resilient circuit whose size is polynomial in the size of the (non-resilient) input ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993